Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm

نویسندگان

  • Haitao Yin
  • Shutao Li
  • Leyuan Fang
چکیده

Compressed sensing is a new sampling technique which can exactly reconstruct sparse signal from a few measurements. In this article, we consider the blocksparse compressed sensing with special structure assumption about the signal. A novel non-convex model is proposed to reconstruct the block-sparse signals. In addition, the conditions of the proposed model for recovering the block-sparse noise or noise-free signals are presented. The experimental results demonstrate that the proposed non-convex method surpasses the convex method (the mixed ‘2=‘1-norm optimization) and some algorithms without considering the blocksparse structure (the ‘1and ‘p-norm optimization).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Compressive Sensing Recovery Using Group Sparse Coding via Non-convex Weighted Lp Minimization

Compressive sensing (CS) has attracted considerable research from signal/image processing communities. Recent studies further show that structured or group sparsity often leads to more powerful signal reconstruction techniques in various CS taskes. Unlike the conventional sparsity-promoting convex regularization methods, this paper proposes a new approach for image compressive sensing recovery ...

متن کامل

Iterative $\ell_1$ minimization for non-convex compressed sensing

An algorithmic framework, based on the difference of convex functions algorithm, is proposed for minimizing a class of concave sparse metrics for compressed sensing problems. The resulting algorithm iterates a sequence of l1 minimization problems. An exact sparse recovery theory is established to show that the proposed framework always improves on the basis pursuit (l1 minimization) and inherit...

متن کامل

Non-convex Fraction Function Penalty: Sparse Signals Recovered from Quasi-linear Systems

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structures, and the linear model is no longer suitable. Compared with the compressed sensing under the linear circumstance, this nonli...

متن کامل

Non-linear compressed sensing and its application to beam hardening correction in x-ray tomography

Traditionally, compressed sensing assumes a linear, ill-posed or non-invertible forward model, which is inverted with the help of non-convex constraints. Recently these ideas have been extended to non-linear forward models. It could be shown that, under certain conditions, strong performance guarantees available for traditional compressed sensing also hold in the non-linear case. In this paper ...

متن کامل

Minimization of ℓ1-2 for Compressed Sensing

We study minimization of the difference of l1 and l2 norms as a non-convex and Lipschitz continuous metric for solving constrained and unconstrained compressed sensing problems. We establish exact (stable) sparse recovery results under a restricted isometry property (RIP) condition for the constrained problem, and a full-rank theorem of the sensing matrix restricted to the support of the sparse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012